Cyclotomic Completions of Polynomial Rings
نویسنده
چکیده
The main object of study in this paper is the completion Z[q] = lim ←−n Z[q]/((1−q)(1−q) · · · (1−q)) of the polynomial ring Z[q], which arises from the study of a new invariant of integral homology 3spheres with values in Z[q] announced by the author, which unifies all the sl2 Witten-Reshetikhin-Turaev invariants at various roots of unity. We show that any element of Z[q] is uniquely determined by its power series expansion in q − ζ for each root ζ of unity. We also show that any element of Z[q] is uniquely determined by its values at the roots of unity. These results may be interpreted that Z[q] behaves like a ring of “holomorphic functions defined on the set of the roots of unity”. We will also study the generalizations of Z[q], which are completions of the polynomial ring R[q] over a commutative ring R with unit with respect to the linear topologies defined by the principal ideals generated by products of powers of cyclotomic polynomials.
منابع مشابه
Provably Secure NTRUEncrypt over More General Cyclotomic Rings
NTRUEncrypt is a fast and standardized lattice-based public key encryption scheme, but it lacks a solid security guarantee. In 2011, Stehlé and Steinfeld first proposed a provably secure variant of NTRUEncrypt, denoted by pNE, over power-of-2 cyclotomic rings. The IND-CPA security of pNE is based on the worst-case quantum hardness of classical problems over ideal lattices. Recently, Yu, Xu and ...
متن کاملPolynomial Time Reduction from Approximate Shortest Vector Problem to Principal Ideal Problem for Lattices in Some Cyclotomic Rings
Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is the principal ideal problem (PIP). Its goal is to find a generator of any principal ideal i...
متن کاملPolynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings
Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is called principle ideal problem (PIP). Its goal is to find a generators of any principle ide...
متن کاملFaster integer and polynomial multiplication using cyclotomic coefficient rings
We present an algorithm that computes the product of two n-bit integers in O(n log n (4\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n}). We also prove that for a fixed prime p, polynomials in F_p[X] of degree n may be multiplied in O(n log n 4^{log^* n}) bit operations; the previous best bound was O(n log n 8^{log^* n}).
متن کاملMultiplication in Cyclotomic Rings and its Application to Finite Fields
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in cyclotomic rings and cyclotomic fields in that most arithmetic operations are done on vectors. From this formulation we can generate optimized algorithms for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002